Pii: S0166-4328(00)00333-8
نویسندگان
چکیده
The effects of several N-methyl-D-aspartate (NMDA) receptorand sigma receptor-related compounds on the discriminative stimulus effects of phencyclidine (PCP) were examined in rats trained to discriminate PCP (1.5 mg/kg, i.p.) from saline under a two-lever fixed ratio 20 schedule of food reinforcement. PCP produced a dose-dependent increase in PCP-appropriate responding. A non-competitive NMDA receptor antagonist, dizocilpine (0.2 mg/kg, i.p.) and a putative sigma1 receptor agonist, (+ )-SKF10047 (10 mg/kg, i.p.) fully substituted for PCP in every rat tested. Neither a competitive NMDA receptor antagonist, CGS-19755 (0.1–3 mg/kg, i.p.), sigma1 receptor agonist, (+ )-pentazocine (10–30 mg/kg, i.p.) nor dextromethorphan (10–20 mg/kg, i.p.) produced PCP-like discriminative stimulus effects. The discriminative stimulus effects of PCP (1.5 mg/kg, i.p.), dizocilpine (0.2 mg/kg, i.p.) and (+ )-SKF-10047 (10 mg/kg, i.p.) were significantly attenuated by CGS-19755 (1 mg/kg, i.p.), but not by sigma1 receptor antagonist BMY-14802 (10 mg/kg, i.p.) and NE-100 (5 mg/kg, i.p.). These results suggest that the discriminative stimulus effects of PCP are predominantly mediated via PCP binding sites on the NMDA receptor-ion channel complex, not via sigma1 receptors. In addition, the PCP-like discriminative stimulus effects of (+ )-SKF-10047 were demonstrated to be mediated via PCP binding sites. © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Connectivity and fault-tolerance of hyperdigraphs
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus networks: the connectivity and the fault-diameter of directed hypergraphs. Some bounds are given for those parameters. As a consequence, we obtain that de Bruijn-Kautz directed hypergraphs and, more generally, iterated ...
متن کاملThe maximum edge biclique problem is NP-complete
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete. A biclique in a bipartite graph is a vertex induced subgraph which is complete. The problem of finding a biclique with a maximum number of vertices is known to be solvable in polynomial time but the complexity of finding a biclique with a maximum number of edges was still undecided.
متن کاملPii: S0166-4328(00)00387-9
Apamin blocks SK channels responsible for long-lasting hyperpolarization following the action potential. Using an olfactory associative task, the effect of an intracerebroventricular 0.3 ng apamin injection was tested on learning and memory. Apamin did not modify the learning of the procedure side of the task or the learning of the odor-reward association. To test reference memory specifically,...
متن کاملClasses of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach
In this work, we introduce the variance expression for quadratic assignment problem (QAP) costs. We also de;ne classes of QAP instances, described by a common linear relaxation form. The use of the variance in these classes leads to the study of isomorphism and allows for a de;nition of a new di"culty index for QAP instances. This index is then compared to a classical measure found in the liter...
متن کامل